A linear-time algorithm for the geodesic center of a simple
نویسندگان
چکیده
6 Let P be a closed simple polygon with n vertices. For any two points in P , the geodesic 7 distance between them is the length of the shortest path that connects them among all 8 paths contained in P . The geodesic center of P is the unique point in P that minimizes the 9 largest geodesic distance to all other points of P . In 1989, Pollack, Sharir and Rote [Disc. 10 & Comput. Geom. 89] showed an O(n logn)-time algorithm that computes the geodesic 11 center of P . Since then, a longstanding question has been whether this running time can 12 be improved. In this paper we affirmatively answer this question and present a linear time 13 algorithm to solve this problem. 14
منابع مشابه
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
In this paper, we show that the L1 geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric properties of the L1 geodesic balls, that is, the metric balls with respect to the L1 geodesic distance. More specifically, in this paper we show that any family of L1 geodesic balls in any simple polygon has Helly number two,...
متن کاملA Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
Let P be a closed simple polygon with n vertices. For any two points in P , the geodesic distance between them is the length of the shortest path that connects them among all paths contained in P . The geodesic center of P is the unique point in P that minimizes the largest geodesic distance to all other points of P . In 1989, Pollack, Sharir and Rote [Disc. & Comput. Geom. 89] showed an O(n lo...
متن کاملAN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملComputing the Geodesic L 1 -diameter and Center of a Simple Rectilinear Polygon
The diameter of a set S of points is the maximal distance between a pair of points in S. The center of S is the set of points that minimize the distance to their furthest neighbours. The problem of nding the diameter and center of a simple polygon with n vertices for diierent distance measures has been studied extensively in recent years. There are algorithms that run in linear time if the geod...
متن کاملComputing the Geodesic Center of a Simple Polygon
The geodesic center of a simple polygon is a point inside the polygon which minimizes the maximum internal distance to any point in the polygon. We present an algorithm which calculates the geodesic center of a simple polygon with n vertices in time O(n log n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015